Nuprl Lemma : fpf-compatible-join-iff 11,40

A:Type, eq:EqDecider(A), B:(AType), f,g,h:fpf(Aa.B(a)).
fpf-compatible(Aa.B(a); eqfg)
 (fpf-compatible(Aa.B(a); eqh; fpf-join(eqfg))
  (fpf-compatible(Aa.B(a); eqhf fpf-compatible(Aa.B(a); eqhg))) 
latex


Definitionst  T, x:AB(x), EqDecider(T), x(s), xt(x), fpf(Aa.B(a)), fpf-compatible(Aa.B(a); eqfg), prop{i:l}, P  Q, fpf-join(eqfg), P  Q, P  Q, P  Q, fpf-ap(feqx), b, top, fpf-dom(eqxf), P  Q, False, A, b, , guard(T), sq_type(T)
Lemmasfpf-compatible-join, bool cases, eqtt to assert, bool sq, iff transitivity, eqff to assert, assert of bnot, bool wf, bnot wf, not wf, fpf-join-ap, fpf-join-dom, assert wf, fpf-dom wf, fpf-trivial-subtype-top, fpf-join wf, fpf-compatible wf, fpf wf, deq wf

origin